Effective Slot Filling Based on Shallow Distant Supervision Methods

نویسندگان

  • Benjamin Roth
  • Tassilo Barth
  • Michael Wiegand
  • Mittul Singh
  • Dietrich Klakow
چکیده

Spoken Language Systems at Saarland University (LSV) participated this year with 5 runs at the TAC KBP English slot filling track. Effective algorithms for all parts of the pipeline, from document retrieval to relation prediction and response post-processing, are bundled in a modular end-to-end relation extraction system called RelationFactory. The main run solely focuses on shallow techniques and achieved significant improvements over LSV’s last year’s system, while using the same training data and patterns. Improvements mainly have been obtained by a feature representation focusing on surface skip n-grams and improved scoring for extracted distant supervision patterns. Important factors for effective extraction are the training and tuning scheme for distant supervision classifiers, and the query expansion by a translation model based on Wikipedia links. In the TAC KBP 2013 English Slotfilling evaluation, the submitted main run of the LSV RelationFactory system achieved the top-ranked F1-score of 37.3%.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New York University 2014 Knowledge Base Population Systems

New York University (NYU) participated in three tracks of the 2014 TAC-KBP evaluation: English Slot Filling, Cold Start and Entity Discovery and Linking. While this year is the first time and second time we participated in entity discovery and linking (EDL) and cold start respectively, we have been working on the slot filling task for several years. With additional development time this year, o...

متن کامل

UNED Slot Filling and Temporal Slot Filling systems at TAC KBP 2013: System description

This paper describes the system implemented by the NLP GROUP AT UNED for the Knowledge Base Population 2013 English Slot Filling (SF) and Temporal Slot Filling (TSF) tasks. For the Slot Filling task, we implemented a distant supervision approach, using Freebase as a source of training relations and news sources to retrieve training examples. For the Temporal Slot Filling task, our approach is b...

متن کامل

New York University 2011 System for KBP Slot Filling

The NYU Knowledge Base Population (KBP) slot filling system for 2011 was built upon the system for 2010. The primary addition was a set of classifiers trained using distant supervision. A secondary addition involved a slot-specific passage retrieval system combined with name-type-based answer selection -in effect, a simple QA system. In the three sections that follow, we review the 2010 baselin...

متن کامل

Stanford ’ s Distantly Supervised Slot Filling Systems for KBP 2014

We describe Stanford’s entry in the TACKBP 2014 Slot Filling challenge. We submitted two broad approaches to Slot Filling, both strongly based on the ideas of distant supervision: one built on the DeepDive framework (Niu et al., 2012), and another based on the multi-instance multilabel relation extractor of Surdeanu et al. (2012). In addition, we evaluate the impact of learned and hard-coded pa...

متن کامل

A Simple Distant Supervision Approach for the TAC-KBP Slot Filling Task

This paper describes the design and implementation of the slot filling system prepared by Stanford’s natural language processing group for the 2010 Knowledge Base Population (KBP) track at the Text Analysis Conference (TAC). Our system relies on a simple distant supervision approach using mainly resources furnished by the track organizers: we used slot examples from the provided knowledge base,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1401.1158  شماره 

صفحات  -

تاریخ انتشار 2013